Counterexamples to a Conjecture of Woods

نویسنده

  • BARAK WEISS
چکیده

A conjecture of Woods from 1972 is disproved. A lattice in R is called well-rounded if its shortest nonzero vectors span R, is called unimodular if its covolume is equal to one, and the covering radius of a lattice Λ is the least r such that R = Λ + Br, where Br is the closed Euclidean ball of radius r. Let Nd denote the greatest value of the covering radius over all well-rounded unimodular lattices in R. In [Woo72], A. C. Woods conjectured that Nd = √ d/2, i.e., that the lattice Z realizes the largest covering radius among wellrounded unimodular lattices. Moreover, Woods proved this statement for d ≤ 6. In [McM05], McMullen proved that Woods’s conjecture implies a celebrated conjecture of Minkowski. Spurred by this result, Woods’s conjecture has been proved for d ≤ 9 by Hans-Gill, Kathuria, Raka, and Sehmi (see [KR14] and references therein), thus yielding Minkowski’s conjecture in those dimensions. In this note we prove: Theorem. There is c > 0 such that Nd > c d √ log d . For all d ≥ 30,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counterexamples to the Poset Conjectures of Neggers, Stanley, and Stembridge

We provide the first counterexamples to Neggers’ 1978 conjecture and Stembridge’s 1997 conjecture that the generating functions for descents and peaks in the linear extensions of naturally labeled posets should have all real zeros. We also provide minimum-sized counterexamples to a generalization of the Neggers conjecture due to Stanley that was recently disproved by Brändén.

متن کامل

On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture

The main result of this paper is the following: Any minimal counterexample to Hadwiger’s Conjecture for the k-chromatic case is 2k 27 -connected. This improves the previous known bound due to Mader [W. Mader, Über trennende Eckenmengen in homomorphiekritischen Graphen, Math. Ann. 175 (1968) 243–252], which says that any minimal counterexample to Hadwiger’s Conjecture for the k-chromatic case is...

متن کامل

Chaotic Polynomial Automorphisms; counterexamples to several conjectures

We give a polynomial counterexample to a discrete version of the Markus-Yamabe Conjecture and a conjecture of Deng, Meisters and Zampieri, asserting that if F : C → C is a polynomial map with det(JF ) ∈ C∗, then for all λ ∈ R large enough λF is global analytic linearizable. These counterexamples hold in any dimension ≥ 4.

متن کامل

Expanders, Exact Crossed Products, and the Baum-connes Conjecture

Abstract. We reformulate the Baum-Connes conjecture with coe cients by introducing a new crossed product functor for C⇤-algebras. All confirming examples for the original Baum-Connes conjecture remain confirming examples for the reformulated conjecture, and at present there are no known counterexamples to the reformulated conjecture. Moreover, some of the known expander-based counterexamples to...

متن کامل

Counterexamples to three conjectures concerning perfect graphs

We will present counterexamples to a conjecture of Hoàng, a conjecture of Hertz and de Werra and to a conjecture of Reed. All these three conjectures are related to perfect graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016